Algorithms for #BIS-Hard Problems on Expander Graphs
نویسندگان
چکیده
منابع مشابه
Distributed Algorithms for Maintaining Dynamic Expander Graphs
We consider the problem of maintaining expansion in an overlay network with dynamic node insertions. We study this problem in two models: one, where insertions are chosen benevolently, and the other, where insertions are chosen by an adversary. For the model of benevolent insertions, the problem has been previously studied empirically by Gkantsidis, Mihail, and Saberi [6]. In this paper, we pre...
متن کاملParallel algorithms based on expander graphs for optical computing.
We consider the task of interconnecting processors to realize efficient parallel algorithms. We propose interconnecting processors using certain graphs called expander graphs, which can provide fast communication from any group of processors to the rest of the network. We show that these interconnections would result in a number of efficient parallel algorithms for sorting, routing, associative...
متن کاملData Stream Algorithms via Expander Graphs
We present a simple way of designing deterministic algorithms for problems in the data stream model via lossless expander graphs. We illustrate this by considering two problems, namely, k-sparsity testing and estimating frequency of items.
متن کاملHard Problems for CSP Algorithms
We prove exponential lower bounds on the running time of many algorithms for Constraint Satisfaction, by giving a simple family of instances on which they always take exponential time. Although similar lower bounds for most of these algorithms have been shown before, we provide a uniform treatment which illustrates a powerful general approach and has stronger impfications for the practice of al...
متن کاملHard SAT and CSP instances with Expander Graphs
In this paper we provide a new method to generate hard k-SAT instances. Basically, we construct the bipartite incidence graph of a k-SAT instance where the left side represents the clauses and the right side represents the literals of our Boolean formula. Then, the clauses are filled by incrementally connecting both sides while keeping the girth of the graph as high as possible. That assures th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2020
ISSN: 0097-5397,1095-7111
DOI: 10.1137/19m1286669